Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
نویسنده
چکیده
Bipolar synchronization systems (BP-systems) constitute a class of coloured Petri nets, well suited for modelling the control flow of discrete dynamical systems. Every BP-system has an underlying ordinary Petri net, a T-system. It further has a second ordinary net attached, a free-choice system. We prove that a BP-system is safe and live if the T-system and the free-choice system are safe and live and the free-choice system in addition has no frozen tokens. This result is the converse of a theorem of Genrich and Thiagarajan and proves an old conjecture. As a consequence we obtain two results about the existence of safe and live BP-systems with prescribed ordinary Petri nets. For the proof of these theorems we introduce the concept of a morphism between Petri nets as a means of comparing different Petri nets. We then apply the classical theory of free-choice systems.
منابع مشابه
Parallel Computation of Reachable Dead States in a Free-choice Petri Net
Free-choice Petri nets are a prominent tool for modeling and analyzing communication protocols, multiprocessor systems, parallel programs, flexible manufacturing systems and workflow scripts. Unfortunately, analysis is often hampered by the state-explosion phenomenon. Even for free-choice Petri nets, the reachability problem is known to be EXPSPACE-hard. In this paper we discuss a technique for...
متن کاملTransactions and Zero-Safe Nets
When employing Petri nets to model distributed systems, one must be aware that the basic activities of each component can vary in duration and can involve smaller internal activities, i.e., that transitions are conceptually refined into transactions. We present an approach to the modeling of transactions based on zero-safe nets. They extend ordinary PT nets with a simple mechanism for transitio...
متن کاملTowards Analysing a Class of Object Petri Nets
The Petri net theory has been used to specify many types of systems, in particular, concurrent, distributed and nondeterministic. A class of high-level, object-based Petri nets, OBJSA nets, is being used to model the behaviour of a concurrent system a priority queue. We propose a method of analysing its behaviour by examining its structure and its underlying subnet components according to the s...
متن کاملOn Compositionality of Boundedness and Liveness for Nested Petri Nets
Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...
متن کاملAlgebraic Higher-Order Nets: Graphs and Petri Nets as Tokens
Petri nets and Algebraic High-Level Nets are well-known to model parallel and concurrent systems. In this paper, we introduce the concept of Algebraic Higher-Order Nets, which allow to have dynamical tokens like graphs or (ordinary low-level) Petri nets. For this purpose, we specify graphs and Petri nets in the higher-order algebraic specification language HasCasl such that graphs and Petri net...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 98 شماره
صفحات -
تاریخ انتشار 2010